Non-Malleable Extractors with Logarithmic Seeds
نویسنده
چکیده
We construct non-malleable extractors with seed length d = O(log n+log(1/ε)) for n-bit sources with min-entropy k = Ω(d), where ε is the error guarantee. In particular, the seed length is logarithmic in n for ε > 2−(logn) 1/3 . This improves upon existing constructions that either require super-logarithmic seed length even for constant error guarantee, or otherwise only support min-entropy n/polylog n.
منابع مشابه
Non-Malleable Extractors - New Tools and Improved Constructions
A non-malleable extractor is a seeded extractor with a very strong guarantee – the output of a non-malleable extractor obtained using a typical seed is close to uniform even conditioned on the output obtained using any other seed. The first contribution of this paper consists of two new and improved constructions of non-malleable extractors: We construct a non-malleable extractor with seed-leng...
متن کاملNon-malleable Extractors with Shorter Seeds and Their Applications
Motivated by the problem of how to communicate over a public channel with an active adversary, Dodis and Wichs (STOC’09) introduced the notion of a non-malleable extractor. A non-malleable extractor nmExt : {0, 1} × {0, 1} → {0, 1} takes two inputs, a weaklyrandom W and a uniformly random seed S, and outputs a string which is nearly uniform, given S as well as nmExt(W,A(S)), for an arbitrary fu...
متن کاملAn E icient Reduction from Two-Source to Non-malleable Extractors
The breakthrough result of Chattopadhyay and Zuckerman (2016) gives a reduction from the construction of explicit two-source extractors to the construction of explicit non-malleable extractors. However, even assuming the existence of optimal explicit nonmalleable extractors only gives a two-source extractor (or a Ramsey graph) for poly(logn) entropy, rather than the optimal O (logn). In this pa...
متن کاملAn Entropy Lower Bound for Non-Malleable Extractors
A (k, ε)-non-malleable extractor is a function nmExt : {0, 1}×{0, 1} → {0, 1} that takes two inputs, a weak source X ∼ {0, 1} of min-entropy k and an independent uniform seed s ∈ {0, 1}, and outputs a bit nmExt(X, s) that is ε-close to uniform, even given the seed s and the value nmExt(X, s′) for an adversarially chosen seed s′ 6= s. Dodis and Wichs (STOC 2009) showed the existence of (k, ε)-no...
متن کاملFlexible Two-Source Extractors and their Applications
We introduce a new notion flexible extractor. It is a generalization of the standard concept of a two-source-extractor which require each of a sources to have some entropy, flexible extractor requires the sum of sources entropy to exceed fixed value. We distinguish between a strong and a weak flexible extractors and (similarly to two-source-extractors case) prove that every weak flexible extrac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 23 شماره
صفحات -
تاریخ انتشار 2016